THE UNIVERSITY OF BIRMINGHAM Proof Planning in Ωmega with Semantic Guidance
نویسندگان
چکیده
Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning uses semantic information as search control heuristics. In this report we describe the realisation of semantically guided proof planning in the framework of the Ωmega system. We realised a module that answers queries from Multi, a multi-strategy proof planner of Ωmega, whether a concrete method application is suitable with respect to the semantic information as well as how promising the method application is. Provided with this information Multi rejects unsuitable method applications and prefers the most promising ones.
منابع مشابه
Proof Planning with Semantic Guidance
Proof planning [2, 10] is a reasoning process in which mathematical theorem proving is viewed as a planning problem. It incorporates domain-dependent and/or general mathematical knowledge, and shows a great potential in the area where the traditional logicbased theorem proving systems have been typically weak. The plan operator – method – encodes a piece of mathematical knowledge. When there ar...
متن کاملProof Development with OMEGA
The Ωmega proof development system [2] is the core of several related and well integrated research projects of the Ωmega research group. Ωmega is a mathematical assistant tool that supports proof development in mathematical domains at a user-friendly level of abstraction. It is a modular system with a central data structure and several complementary subsystems. Ωmega has many characteristics in...
متن کاملOn the Comparison of Proof Planning Systems λCLaM, Ωmega and IsaPlanner
We present a framework for describing proof planners. This framework is based around a decomposition of proof planners into planning states, proof language, proof plans, proof methods, proof revision, proof control and planning algorithms. We use this framework to motivate the comparison of three recent proof planning systems, λCLaM, Ωmega and IsaPlanner, and demonstrate how the framework allow...
متن کاملΩmega: Computer Supported Mathematics
The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated deduction used machine oriented calculi to find the proof for a theorem by automatic means, the Autom...
متن کاملRepresenting Proof-Planning in the ρ-Calculus
Introduction. Proof planning is a theorem proving technique in which proofs are not conceived immediately by using the low-level calculus rules but at a higher level of abstraction that highlights the main ideas and the outline of a proof and de-emphasizes minor logical or mathematical manipulations on formulae. Hence, proof planning considerably differs from traditional proof search strategies...
متن کامل